Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs
نویسندگان
چکیده
We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| ≥ 213. 1998 ACM Subject Classification F.2.3 Tradeoffs between Complexity Measures
منابع مشابه
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...
متن کاملRestricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching ...
متن کاملNeither Reading Few Bits Twice nor Reading
We rst consider so-called (1; +s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing a characteristic function of a linear code C has size at least 2 (minfd 1 ; d 2 =sg) , where d 1 and d 2 are the minimal distances of C and its dual C ?. We apply this criterion to explicit linear codes and obtain a sup...
متن کاملNeither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing a characteristic function of a linear code C has size at least 2Ω(min{d1, d2/s}), where d1 and d2 are the minimal distances of C and its dual C ⊥. We apply this criterion to explicit linear codes and obtain a super-pol...
متن کاملLower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we contribute to the complexity theory of randomized read-k-times branching programs. We first consider the case k = 1 and present a function which has nondeterministic read-once branching programs of polynomial size, but for which every rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016